New Negative Results on Differing-Inputs Obfuscation
نویسندگان
چکیده
We provide the following negative results for differing-inputs obfuscation (diO): (1) If subexponentially secure one-way functions exist then sub-exponentially secure diO for TMs does not exist (2) If in addition sub-exponentially secure iO exists then polynomially secure diO for TMs does not exist. 1 Department of Computer Science & Engineering, University of California San Diego, 9500 Gilman Drive, La Jolla, California 92093, USA. Email: [email protected]. URL: https://cseweb.ucsd.edu/~mihir/. Supported in part by NSF grants CNS-1526801 and CNS-1228890, ERC Project ERCC FP7/615074 and a gift from Microsoft. 2 Department of Computer Science & Engineering, University of California San Diego, 9500 Gilman Drive, La Jolla, California 92093, USA. Email: [email protected]. URL: https://cseweb.ucsd.edu/~istepano/. Supported in part by NSF grants CNS-1526801 and CNS-1228890, ERC Project ERCC FP7/615074 and a gift from Microsoft. 3 Department of Computer Science, University of Texas at Austin, 2317 Speedway, Austin, Texas 78712, USA. Email: [email protected]. URL: https://www.cs.utexas.edu/~bwaters/. Supported in part by NSF grants CNS-1228599 and CNS-1414082, DARPA SafeWare, a Google Faculty Research award, the Alfred P. Sloan Fellowship, a Microsoft Faculty Fellowship and a Packard Foundation Fellowship.
منابع مشابه
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
We show the following result: Assuming the existence of public-coin differing-input obfuscation (pc-diO) for the class of all polynomial time Turing machines, then there exists a four message, fully concurrent zero-knowledge proof system for all languages in NP with negligible soundness error. This result is constructive: given pc-diO, our reduction yields an explicit protocol along with an exp...
متن کاملPoly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
We show how to extract an arbitrary polynomial number of simultaneously hardcore bits from any oneway function. In the case the one-way function is injective or has polynomially-bounded pre-image size, we assume the existence of indistinguishability obfuscation (iO). In the general case, we assume the existence of differing-input obfuscation (diO), but of a form weaker than full auxiliary-input...
متن کاملPublic-Coin Differing-Inputs Obfuscation and Its Applications
Differing inputs obfuscation (diO) is a strengthening of indistinguishability obfuscation (iO) that has recently found applications to improving the efficiency and generality of obfuscation, functional encryption, and related primitives. Roughly speaking, a diO scheme ensures that the obfuscations of two efficiently generated programs are indistinguishable not only if the two programs are equiv...
متن کاملOn Extractability (a.k.a. Differing-Inputs) Obfuscation
We initiate the study of extractability obfuscation (a.k.a. differing-inputs obfuscation), a notion first suggested by Barak et al. (JACM 2012): An extractability obfuscator eO for a class of algorithmsM guarantees that if an efficient attacker A can distinguish between obfuscations eO(M1), eO(M2) of two algorithms M1,M2 ∈M, then A can efficiently recover (given M1 and M2) an input on which M1 ...
متن کاملKDM Security for Identity-Based Encryption: Constructions and Separations
For encryption schemes, key dependent message (KDM) security requires that ciphertexts preserve secrecy even when the encrypt messages may depend on the secret keys. While KDM security has been extensively studied for public-key encryption (PKE), it receives much less attention in the setting of identity-based encryption (IBE). In this work, we focus on the KDM security for IBE. Our results are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016